Bulletin of the New York Mathematical Society

The lower bound for the number of 1-factors in generalized Petersen graphs

‎In this paper‎, ‎we investigate the number of 1-factors of a‎ ‎generalized Petersen graph $P(N,k)$ and get a lower bound for the‎ ‎number of 1-factors of $P(N,k)$ as $k$ is odd‎, ‎which shows that the‎ ‎number of 1-factors of $P(N,k)$ is exponential in this case and‎ ‎confirms a conjecture due to Lovász and Plummer (Ann‎. ‎New York Acad‎. ‎Sci‎. ‎576(2006)‎, ‎no‎. ‎1‎, ‎389-398).

A New Class of Banach Sequence Spaces

Some New Characterization Results on Exponential and Related Distributions

New Barrier Parameter Updating Technique in Mehrotra-Type Algorithm

An Investigation of the Generic Features of Research Articles Published in the Bulletin of Iranian Mathematical Society

In light of the understanding that the analysis of the generic features of different academic genres can enhance the ability of non-native members of academic discourse communities to understand, and where appropriate, to produce them, the present study aimed at investigating the dominant generic structure of research articles in mathematics. To start with a relatively narrow focus, a corpus of...